/*
 * @lc app=leetcode.cn id=5 lang=java
 *
 * [5] 最长回文子串
 */

// @lc code=start
class Solution {
    public String longestPalindrome(String s) {
        int l = 0,r = 0;
        int n = s.length();
        
        int[][] dp = new int[n][n];
        
        return s.substring(l, r);
    }
}
// @lc code=end

